منابع مشابه
Presenting Finite Posets
String rewriting systems have been originally introduced by Thue [21] in order to study word problems in monoids. A string rewriting system (Σ,R) consists of a set Σ, called the alphabet, and a set R ⊆ Σ∗×Σ∗ of rules. The monoid Σ∗/≡R, obtained by quotienting the free monoid Σ∗ over Σ by the smallest congruence (wrt concatenation) containing R, is called the monoid presented by the rewriting sy...
متن کاملReducibility in Finite Posets
All the posets/lattices considered here are finite with element 0. An element x of a poset satisfying certain properties is deletable if P − x is a poset satisfying the same properties. A class of posets is reducible if each poset of this class admits at least one deletable element. When restricted to lattices, a class of lattices is reducible if and only if one can go from any lattice in this ...
متن کاملPosets of Finite Functions
The symmetric group S(n) is partially ordered by Bruhat order. This order is extended by L. Renner to the set of partial injective functions of {1, 2, . . . , n} (see, Linear Algebraic Monoids, Springer, 2005). This poset is investigated by M. Fortin in his paper The MacNeille Completion of the Poset of Partial Injective Functions [Electron. J. Combin., 15, R62, 2008]. In this paper we show tha...
متن کاملFinite dimensional scattered posets
We discuss a possible characterization, bymeans of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains. © 2013 Elsevier Ltd. All rights reserved. 0. Introduction and presentation of the results A fundamental result, due to Szpilrajn [33], states that every order on a set is the intersection of a family of linear orders on this set. The dimensi...
متن کاملOperads of Finite Posets
We describe four natural operad structures on the linear species of finite posets. The three last ones are set-theoretical and can be seen as a simplified version of the first, the same way the NAP operad behaves with respect to the pre-Lie operad. Moreover the two first ones are isomorphic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2015
ISSN: 2075-2180
DOI: 10.4204/eptcs.183.1